General three and four person two color Hat Game
نویسنده
چکیده
distinguishable players are randomly fitted with a white or black hat, where the probabilities of getting a white or black hat may be different for each player, but known to all the players. All players guess simultaneously the color of their own hat observing only the hat colors of the other − 1 players. It is also allowed for each player to pass: no color is guessed. The team wins if at least one player guesses his hat color correctly and none of the players has an incorrect guess. No communication of any sort is allowed, except for an initial strategy session before the game begins. Our goal is to maximize the probability of winning the game and to describe winning strategies, using the concept of an adequate set. We find explicit solutions in case of =3 and =4.
منابع مشابه
The Three-hat Problem
Many classical puzzles involve hats. The general setting for these puzzles is a game in which several players are each given a hat to wear. Associated with each hat is either a color or a number. Every player can see the color or number of everyone else’s hat but not his own. The players are then trying to figure out the colors or the numbers on their own hats. The Three-Hat Problem is one of s...
متن کاملA Combinatorial Approach to Ebert's Hat Game with Many Colors
This paper proves an optimal strategy for Ebert’s hat game with three players and more than two hat colors. In general, for n players and k hat colours, we construct a strategy that is asymptotically optimal as k →∞. Computer calculation for particular values of n and k suggests that, as long as n is linear with k, the strategy is asymptotically optimal. We conclude by comparing our strategy wi...
متن کاملAsymmetric Hat Game with three players and three colors
The Hat Game (Ebert’s Hat Problem) got much attention in the beginning of this century; not in the last place by its connections to coding theory and computer science. This paper studies Ebert’s hat problem with three persons and three colors, where the probabilities of the colors may be different (asymmetric case) . All players guess simultaneously the color of their own hat observing only the...
متن کاملThe Hat Game and covering codes
The Hat Game (Ebert’s Hat Problem) got much attention in the beginning of this century; not in the last place by its connections to coding theory and computer science. There were publications in The New York Times, Die Zeit and abcNews. Exact solutions with two colors are only known in the symmetric case (equal probabilities for the two colors) when = 2 − 1 (using Hamming codes), = 2 (extended ...
متن کاملFinite and Innite Hat Problems
This project will discuss hat problems and the Axiom of Choice. A basic example of a nite hat problem is helpful in introducing the concept. Assume that there are two players and two possible hat colors, red and blue. The players will be given a certain amount of time before the game begins to communicate and create a strategy for determining their own hat colors. After this initial strategy s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1704.04244 شماره
صفحات -
تاریخ انتشار 2017